Hypothetical reference decoder for compressed image and video

ABSTRACT

One method for analyzing a bitstream having a plurality of compressed pictures comprises computing an initial arrival time and a final arrival time of a compressed picture, wherein the initial arrival time is equal to an earlier of the final arrival time of the immediately previous compressed picture or equal to a sum of a fixed time plus a sum of removal delays of all of the compressed pictures between the first compressed picture following the buffering period message and the compressed picture, including the compressed picture, and wherein the final arrival time is equal a sum of the initial arrival time and a time calculated based on the number of bits associated with the compressed picture at the bit rate; and verifying that a difference between the final removal time and the initial arrival time does not exceed the time for reaching the buffer size at the bit rate.

RELATED APPLICATIONS

The present application claims the benefit of U.S. provisionalapplication Ser. No. 60/393,665, filed Jul. 2, 2002, which is herebyfully incorporated by reference in the present application.

BACKGROUND OF THE INVENTION

1. Field of the Invention

The present invention relates generally to image and video signals. Moreparticularly, the present invention relates to coding or compressingimage and video signals.

2. Related Art

In video coding standards, such as MPEG-1, MPEG-2, MPEG-4, H.261, H.263and the new H.264/MPEG-4 Part 10, a bitstream is determined to beconformant if the bitstream adheres to the syntactical and semanticrules embodied in the standard. One such set of rules takes the form ofsuccessful flow of the bitstream through a mathematical or hypotheticalmodel of a decoder, which receives the bitstream from an encoder. Such amodel decoder is referred to as the hypothetical reference decoder(“HRD”) in some standards or the video buffer verifier (“VBV”) in otherstandards. In other words, the HRD specifies rules that bitstreamsgenerated by a video signal encoder must adhere to for such encoder tobe considered conformant under a given standard. Stated differently, aHRD is a normative means according to which encoders must createbitstreams, which bitstreams adhere to certain rules and constraints,and real decoders can assume that such rules have been conformed withand such constraints are met.

The HRD serves to place constraints on the variations in bit rate overtime in a compressed bitstream. HRD may also serve as atiming-and-buffering model for a real decoder implementation or for amultiplexor. Associated with the HRD are syntax elements defined in thestandard, and algorithms embodied in software or hardware in variousproducts such as encoders, multiplexors, conformance analyzers, and soon.

The HRD represents a means to communicate how the bit rate is controlledin the process of compression. The HRD may be designed for variable orconstant bit rate operation, and for low-delay or delay-tolerantbehavior. As shown in FIG. 1, HRD 100 includes pre-decoder buffer 110(or VBV buffer) through which compressed bitstream 105 flows with aprecisely specified arrival and removal timing. Compressed bitstream 105contains a sequence of coded pictures 115 and associated ancillarymessages, which flow into pre-decoder buffer 110 according to aspecified arrival schedule. All compressed bits associated with a givencoded picture 115 are removed from pre-decoder buffer 110 byinstantaneous decoder 120 at the specified removal time of the picture.Pre-decoder buffer 110 overflows if the buffer becomes full and morebits are arriving. Pre-decoder buffer 110 underflows if the removal timefor a picture occurs before all compressed bits representing the picturehave arrived. Typically, HRDs differ in the means to specify the arrivalschedule and removal times, and the rules regarding overflow andunderflow of pre-decoder buffer 110.

HRDs in accordance with some existing standards such as H.263 and H.261have been designed for low-delay operation. In short, such HRDs operateby removal of all bits associated with a picture the first time thebuffer is examined, rather than at a time transmitted in the bitstream.Such HRDs do not specify when the bitstream arrives in the pre-decoderbuffer. Therefore, such HRDs do not allow for precisely timed removal ofbits from the pre-decoder buffer and create a difficulty for systemsdesigned to display pictures with precise timing.

Other HRD standards, such as MPEG-2, can operate in variable bit rate orconstant bit rate mode and also have a low-delay mode. The MPEG-2 HRD(known as the VBV) has two modes of operation based on whether a pictureremoval delay is transmitted in the bitstream or not. In the first modeof operation or mode A, when the removal delay is transmitted, the rateof arrival into the VBV buffer of each picture is computed based onpicture sizes, the removal delay and additional removal time increments.Mode A can be used by the encoder to create both variable and constantbit rate streams. However, mode A suffers from a shortcoming that theentire bitstream must be scanned in order to make a determination as towhether a given bitstream has a constant bit rate. Mode A furthersuffers from an ambiguity at the beginning of the sequence that preventsthe initial bit rate from being determined. Therefore, technically, modeA does not allow for a determination as to whether the bitstream is aconstant bit rate (“CBR”) bitstream.

In its second mode of operation or mode B (which is also referred to asa leaky bucket), unlike mode A, the encoder does not transmit theremoval delays. In mode B, the arrival rate is constant unless thepre-decoder buffer is full, under which condition no bits arrive. Thus,mode B, having a constant arrival rate, does not introduce an ambiguityregarding the initial arrival rate. However, mode B has an arrivalschedule, which may not be constrained to model the real production ofbits. This unconstrained aspect of mode B can result in very largedelays through a real decoder and limits its use as guidance forreal-time multiplexors. In mode B, compressed data arrives in the VBVbuffer at the peak rate of the buffer until the buffer is full, at whichpoint the data stops. The initial removal time is the exact point intime when the buffer becomes full. Subsequent removal times are delayedby fixed frame or field periods with respect to the first.

As a hypothetical example of the long delays the Mode B may introduce,consider an encoder that produces a long sequence of very small pictures(i.e. few bits are used to compress each picture) at the start of thesequence. For the purpose providing an example, consider that 1,000small pictures that can all fit in the VBV buffer are produced. All1,000 pictures would enter the buffer in a time less than thetime-equivalent of the buffer size, which is typically less than onesecond. The last of such pictures would then remain in the buffer for999 picture periods longer than the first picture, or roughly 30seconds. This requires that the encoder create a delay of that sameamount of time before transmitting the first picture. However, inreal-time broadcast applications, it is not generally possible to inserta thirty-second delay at the encoder. Rather, an encoder can onlytransmit the bits associated with the small pictures after they havebeen produced. In terms of a VBV model, this would introduce a series oftime intervals during which the VBV buffer is not full, but no bits areentering. Therefore, a real-time encoder cannot imitate the bufferarrival timing of mode B of VBV.

In both modes A and B, the removal times are based on a fixed framerate. Neither of these MPEG-2 VBV modes can handle variable frame rate,except for the one special case of film content captured as video. Inthis special case, the removal time of certain pictures is delayed byone field period, based on the value of a bit field in the pictureheader of that picture or a previous picture.

As opposed to mode A of VBV in which the encoder must prevent bothbuffer overflow and under flow, in mode B, it is impossible for thebuffer to overflow, as data stops entering when the buffer becomes full.However, in mode B, the encoder must still prevent buffer underflow.

The MPEG-2 VBV also includes a separately specified low-delay mode. Inthe low-delay mode, the pre-decoder buffer may underflow occasionallyand there are precise rules, involving skipping pictures, which definehow the VBV is to recover. Because of the number of modes of operation,and the arcane method of handling the one special case of variable framerate, the MPEG-2 VBV is overly complex. It also suffers from the initialrate ambiguity of Mode A and the non-causality of Mode B.

A need exists for an improved hypothetical reference decoder thataddresses the problems and deficiencies associated with the existingHRDs.

SUMMARY OF THE INVENTION

In accordance with the purpose of the present invention as broadlydescribed herein, there is provided system and method for coding orcompressing image and video signals. In one aspect of the presentinvention, a bitstream has a plurality of compressed pictures and aplurality of messages, and a method of analyzing the bitstream comprisesthe steps of: locating a buffering information message including bitrate information and buffer size information; extracting the bit rateinformation and the buffer size information from the bufferinginformation message; computing a bit rate and a buffer size from the bitrate information and buffer size information; selecting a random accesspoint in the bitstream; locating a buffering period message followingthe random access point; extracting random access buffering informationfrom the buffering period message; computing from the random accessbuffering information a picture removal time associated with the firstpicture following the buffering period message; wherein for eachcompressed picture in the bitstream following the first picture.

The method further comprises locating a picture message includingpicture removal time delay information; extracting the picture removaltime delay information from the picture message; computing from thepicture removal time delay information a picture removal time of thecompressed picture; wherein for each compressed picture following thebuffering period message. The method also comprises counting the numberof bits representing the compressed picture; computing an initialarrival time and a final arrival time of the compressed picture, whereinthe initial arrival time is equal to an earlier of the final arrivaltime of the immediately previous compressed picture or equal to a sum ofa fixed time plus a sum of removal delays of all of the compressedpictures between the first compressed picture following the bufferingperiod message and the compressed picture, including the compressedpicture, and wherein the final arrival time is equal a sum of theinitial arrival time and a time calculated based on the number of bitsassociated with the compressed picture at the bit rate; and verifyingthat a difference between the final removal time and the initial arrivaltime does not exceed the time for reaching the buffer size at the bitrate.

In a further aspect, the method comprises verifying for each of thecompressed pictures that the final arrival time precedes the removaltime, and verifying that the initial arrival time of each of thecompressed pictures is equal to the final arrival time of theimmediately previous compressed picture.

In another aspect of the present invention, there is provided a systemfor processing compressed data, the compressed data including a firstpicture and a subsequent second picture, each of the pictures includinga plurality of bits starting with a first bit. The system comprises adecoder configured to receive the compressed data and decompress thecompressed data, the decoder having a pre-decoder buffer configured tobuffer the compressed data; wherein the first bit of the first pictureenters the pre-decoder buffer at a first time and the first bit of thesecond picture enters the pre-decoder buffer at a second time, andwherein the first bit of the first picture leaves the pre-decoder bufferat a third time and the first bit of the second picture leaves thepre-decoder buffer at a fourth time; and wherein a difference based onthe second time and the first time is not less than a difference basedon the fourth time and the third time.

In yet another aspect of the present invention, there is provided abitstream generated by a system. The bitstream comprising: a pluralityof compressed pictures, each of the compressed pictures including aplurality of bits starting with a first bit; and a pre-decoder bufferdelay for each of the plurality pictures; wherein a decoder stores theplurality of compressed pictures in a pre-decoder buffer, and whereineach of the plurality of pictures is removed from the pre-decoder bufferat a time calculated by adding the pre-decoder buffer delay to a removaltime of its immediate previous picture.

In further aspect of the present invention, there is provided a methodfor processing data using a pre-decoder buffer, the data including aplurality of compressed pictures, each of the compressed picturesincluding a plurality of bits starting with a first bit, the datafurther including a pre-decoder buffer delay for each of the pluralitypictures. The method comprising: storing the plurality of compressedpictures in the pre-decoder buffer; calculating a time for removing eachof the plurality of pictures by adding the pre-decoder buffer delay to aremoval time of its immediate previous picture; and removing each of theplurality of pictures from the pre-decoder buffer at the time.

These and other aspects of the present invention will become apparentwith further reference to the drawings and specification, which follow.It is intended that all such additional systems, methods, features andadvantages be included within this description, be within the scope ofthe present invention, and be protected by the accompanying claims.

BRIEF DESCRIPTION OF THE DRAWINGS

The features and advantages of the present invention will become morereadily apparent to those ordinarily skilled in the art after reviewingthe following detailed description and accompanying drawings, wherein:

FIG. 1 illustrates a block diagram of a hypothetical reference decoder;

FIG. 2A illustrates the Video Coding Layer of the audio/video coding(“AVC”) bitstream;

FIG. 2B illustrates the Network Adaptation Layer of the AVC bitstream;

FIG. 3 illustrates an HRD conformance verifier;

FIG. 4 illustrates a buffer fullness plot for hypothetical referencedecoder of FIG. 5A with picture sizes given in FIG. 5B, according to oneembodiment of the present invention;

FIG. 5A illustrates a set of parameters for a hypothetical referencedecoder, according to one embodiment of the present invention; and

FIG. 5B illustrates picture sizes for use by the hypothetical referencedecoder of FIG. 5A for illustrating the plot of FIG. 4.

DETAILED DESCRIPTION OF THE INVENTION

The following description of the invention contains specific informationpertaining to the implementation of the present invention. One skilledin the art will recognize that the present invention may be implementedin a manner different from that specifically discussed in the presentapplication. Moreover, some of the specific details of the invention arenot discussed in order to avoid obscuring the invention. The specificdetails not described in the present application are within theknowledge of a person of ordinary skill in the art. The drawings in thepresent application and their accompanying detailed description aredirected to merely example embodiments of the invention. To maintainbrevity, other embodiments of the invention which use the principles ofthe present invention are not specifically described in the presentapplication and are not specifically illustrated by the presentdrawings.

I. Overview of HRD and Buffering Verifiers

As discussed above, HRD 100 represents a set of requirements onbitstreams. These constraints must be enforced by an encoder, and can beassumed by a decoder or multiplexor to be true. According to oneembodiment of the present invention shown in FIG. 3, HRD verifyingsystem 300 can be constructed to verify conformance of a bitstream tothe requirements set forth below by examining the bitstream.

In the following, the term bitstream shall be used to refer to all formsof AVC streams. As shown in FIG. 2, a bitstream conforming to the AVCHRD may include one or two layers. The first or lower layer, known asthe Video Coding Layer (VCL) in the AVC standard, is composed of most ofthe information required to decode the pixel values which compose thedecoded pictures. Each compressed picture comprises a set of one or moreslices, and each slice further comprises the compressed data thatrepresent a portion of the picture area. FIG. 2A shows a portion of aVCL including compressed picture n 200, compressed picture n+1 201, andcompressed picture n+2 202. FIG. 2A further shows the slice partition204 of compressed picture n. The second layer of the AVC standard isknown as the Network Adaptation Layer (NAL). The NAL is composed of thecompressed pictures from the VCL interleaved with additional messagessuch as: sequence level information which applies to the entire sequenceof compressed pictures; picture attributes applying only to the nextcompressed picture in the bitstream; and other ancillary information. InAVC, both the VCL and NAL are partitioned into non-overlapping NALunits. FIG. 2B shows a portion of a NAL bitstream composed of the threecompressed pictures 201-203 interleaved with additional messages inother NAL units 211-213. In short, the VCL is composed of a sequence ofNAL units containing compressed pictures in the form of slices and theNAL is composed of a sequence of NAL units some of which are VCL NALunits and some of which contain other information. Both the VCL and theNAL forms are referred to as bitstreams in the following description.

An HRD may apply to the VCL or the NAL or both. Furthermore, multipleHRDs may apply to either form of the same bitstream. Each HRD may be aconstant bit-rate or a variable bit-rate HRD. Such variations aresignaled in the bitstream syntax given below.

In one embodiment, HRD 100 uses two time bases. One time base is a 90kHz clock, which is in operation for a short time after the reception ofa buffering period message, which is used for initializing HRD 100. Thesecond time base uses the num_units_in_tick and time_scale syntax in theparameter set to derive the time interval between picture removals fromthe buffers, and in some cases between picture arrivals to pre-decoderbuffer 110.

In the following description, t_(c)=num_units_in_tick/time_scale is theclock tick associated with the second clock, and be[t] and te[b] are thebit equivalent of a time t and the time equivalent of a number of bitsb, with the conversion factor being the buffer arrival bit rate:

A. Operation of Pre-decoder Buffer

1. Timing of Bitstream Arrival

Initially, when pre-decoder buffer 110 is empty, the first byte of thefirst transmitted picture begins to enter pre-decoder buffer 110 atinitial arrival time t_(ai)(0))=0 at the bit-rate associated R with theparticular VBV buffer (R=400*bit_rate_value_xxx). Further, the last bitof the first transmitted picture finishes arriving at final arrivaltime:t _(af)(0)=b(0)/R,  (D-1)where b(n) is the size in bits of the n-th transmitted picture,including either VCL bytes only or both VCL and NAL bytes, depending onthe mode of operation of the HRD. The final arrival time for eachpicture is the sum of the initial arrival time and the time required forthe bits associated with that picture to enter pre-decoder buffer 110:t _(af)(n)=t _(ai)(n)+b(n)/R.  (D-2)

For each subsequent picture, the initial arrival time of picture n isthe later of t_(af)(n−1) and the sum of all precedingpre_dec_removal_delay times as indicated in equation D-3 below:

$\begin{matrix}{{t_{ai}(n)} = {\max\left\{ {{t_{af}\left( {n - 1} \right)},{t_{c} \times {\sum\limits_{i = 1}^{n}{{pre\_ dec}{\_ removal}{\_ delay}(n)}}}} \right\}}} & \text{(D-3)}\end{matrix}$

When an encoder is producing a bit rate lower than the bit rateassociated with a VBV buffer, rule (D-3) may delay the entry of somepictures into pre-decoder buffer 110, producing periods during which nodata enters.

2. Timing of Coded Picture Removal

In the event that HRD 100 pertains to VCL data only, the coded dataassociated with picture n includes all VCL data for that picture. If HRD100 pertains to multiplexed VCL/NAL data, the coded data associated withpicture n includes all VCL data for that picture plus all NAL data afterthe end of picture n−1 and before the end of picture n. For the firstpicture and all pictures that are the first complete picture afterreceiving a buffering period SEI message, the coded data associated withthe picture is removed from the VBV buffer at a removal time equal tothe following:t _(r)(0)=pdrd_xxx/90000  (D-4)where pdrd_xxx is the pre-decoder removal delay in the buffering periodSEI message.

After the first picture is removed, pre-decoder buffer 110 is examinedat subsequent points of time, each of which is delayed from the previousone by an integer multiple of the clock tick t_(c), which is an integermultiple of the picture rate. The removal time t_(r)(n) of coded datafor picture n is delayed with respect to that of picture n−1; where thedelay is equal to the number of picture periods indicated in thepre_dec_removal_delay syntax element present in the picture layer RBSP(Raw Byte Sequence Payload).t _(r)(n)=t _(r)(n−1)+t _(c)×pre_dec_removal_delay(n)   (D-5)

Next, the coded data for the next transmitted picture is removed frompre-decoder buffer 100. In the event that the amount of coded data forpicture n, b(n), is so large that removal cannot be accomplished at thecomputed removal time, the coded data is removed at the delayed removaltime, t_(r,ld)(n, m*), given by:t _(r,d)(n,m*)=t _(r)(0)+t _(c) ×m*,  (D-6)where m* is such that t_(r,d)(n, m*−1)<t_(af)(n)≦t_(r,ld)(n, m*). Thisis an aspect of low-delay operation. This delayed removal time is thenext time instant after the final arrival time t_(af)(n) which isdelayed with respect to t_(r)(0) by an integer multiple of t_(c).

3. Conformance Constraints on Coded Bitstreams

In one embodiment of the present invention, a transmitted or storedbitstream must fulfill some or all of the following four requirements tobe considered conformant. First, for each picture, the removal timest_(r)(n) computed using different buffering periods as starting pointsfor decoding shall be consistent to within the accuracy of the twoclocks used (90 kHz clock used for initial removal time and t_(c) clockused for subsequent removal time calculations). In one embodiment, theconsistency may be translated to mean equality. An encoder can complywith this requirement by computing the pre-decoder removal delay(pdrd_xxx) for a buffering period SEI message from the arrival andremoval times computed using equations D-3 and D-5 above. In anotherembodiment, the removal delay computed using the Buffering period SEImessage initial_pre_dec_removal_delay is lower than that computed usingthe picture layer pre_dec_removal_delay.

Second, with the exception of isolated low-delay mode pictures that aredescribed below, all bits from a picture must be in pre-decoder buffer110 at the picture's computed removal time t_(r)(n). In other words, apicture's final arrival time must precede the picture's removal time:t_(af)(n)≦t_(r)(n).

Third, if the final arrival time t_(af)(n) of picture n exceeds itscomputed removal time t_(r)(n), its size must be such that it can beremoved from pre-decoder buffer 110 without overflow at t_(r,d)(n,m*) asdefined above.

Fourth, if the bitstream conforms to CBR VBV buffer 260, data shallarrive continuously at the input to CBR VBV buffer 260. This isequivalent to ensuring that:

${t_{af}\left( {n - 1} \right)} \geq {t_{c} \times {\sum\limits_{i = 1}^{n}{{pre\_ dec}{\_ removal}{\_ delay}{(i).}}}}$

Note that as a result of equation (D-3), the difference between thearrival times of the first picture t_(ai)(0) and any other secondpicture t_(ai)(n) can be no less than the sum of the removal delays ofall the pictures after the first picture and before the second picture(including the second picture)

$t_{c} \times {\sum\limits_{i = 1}^{n}{{pre\_ dec}{\_ removal}{\_ delay}{(n).}}}$This sum of removal delays is exactly the difference in removal timesbetween the two pictures t_(r)(n)−t_(r)(0). However, other embodimentscould use different measures of the difference, including the additionor subtraction of a fixed offset to the constraint.

B. Operation of Verifier

The conformance of a bitstream to the above described HRD constraintsmay be accomplished by means of a verifier as described below. FIG. 3shows a verifier 300. Bitstream 310 is subjected to a sequence messagefiltering operation 301, which locates messages in the bitstreamindicative of the bit rate and buffer size and extracts bit rate andbuffer size information 311 and HRD configuration information 318 fromthe messages. Bitstream 310 is further subjected to a picture andbuffering message filtering operation 302, which locates messagescontaining picture removal delay information 312 and extracts thatinformation. Bitstream 310 is further subjected to a picture sizecomputing operation 303, which produces the size of each compressedpicture (in number of bits) 313. Information 311, 312 and 313 are usedwithin arrival and removal time computing element 304 to determine theinitial and final arrival times and removal time for each compressedpicture according to sections I.A.1 and I.A.2 described above. For eachcompressed picture, times 314, 315 and 316 are used within constraintchecker 305 to indicate conformance according to the constraintsdescribed in section I.A.3, which constraints are implemented inconstraint checker 305 depends on HRD configuration information 318.

II. HRD Description

The following section of the present application complements thenormative description of the previous section by providing aninformative description of the present invention, which includes theexplanatory text describing the operation and capabilities of HRD 100.

A. Constrained Arrival Time Leaky Bucket (CAT-LB) Model

HRD 100 of the present application is a mathematical model for adecoder, a decoder input buffer, and the channel. HRD 100 ischaracterized by the channel's peak rate R (in bits per second), thebuffer size B (in bits), the initial decoder removal delay T (inseconds), and picture removal delays for each picture. The first threeparameters {R, B, T} represent levels of resources (transmissioncapacity, buffer capacity, and delay) used to decode a bitstream.

The above-referenced term “leaky bucket” arises from analogizing theencoder to a system that dumps water in discrete chunks into a bucketwith a hole. The departure of bits from the encoder buffer correspondsto water leaking out of the bucket. Typically, the decoder buffer has aninverse behavior, where bits flow in at a constant rate, and are removedin chunks. The leaky bucket described in the present application can betermed a constrained arrival time leaky bucket (CAT-LB), because thearrival times of all pictures after the first are constrained to arriveat the buffer input no earlier than the difference in hypotheticalencoder processing times between that picture and the first picture. Forexample, if a second picture is encoded exactly seven (7) seconds afterthe first picture was encoded, then the second picture's bits areguaranteed not to start arriving in the buffer prior to seven (7)seconds after the bits of the first picture started arriving. It shouldbe noted that this encoding time difference is sent in the bitstream asthe picture removal delay.

1. Operation of the CAT-LB HRD

Pre-decoder buffer 110 has a capacity of B bits. Initially, pre-decoderbuffer 110 begins empty. The lifetime of the coded bits, in pre-decoderbuffer 110, associated with picture n is characterized by the arrivalinterval {t_(ai)(n), t_(af)(n)} and the removal time t_(r)(n). Theend-points of the arrival interval are known as the initial arrival timeand the final arrival time. At time t_(ai)(0)=0, pre-decoder buffer 110begins to receive bits at the rate R. The removal time t_(r)(0) for thefirst picture is computed from the pre-decoder removal delay pdrd_xxx ofbuffering period SEI message associated with pre-decoder buffer 110 bythe following:t _(r)(0)=90,000×pdrd_(—xxx.)  (D-7)

Removal times t_(r)(1), t_(r)(2), t_(r)(3), . . . , for subsequentpictures (in transmitted order) are computed with respect to t_(r)(0),as follows, where the picture period t_(c) is defined by:t _(c)=num_units_in_tick/time_scale  (D-8)

It should be noted that the picture period is the shortest possibleinter-picture capture interval in seconds for the sequence. Forinstance, if time_scale=60,000 and num_units_in_tick=1,001, then:t _(c)=1,001/60,000=16.68333 . . . milliseconds.  (D-9)

In the picture layer RBSP for each picture, there is apre_dec_removal_delay syntax element. This element indicates the numberof picture periods to delay the removal of picture n after removingpicture n−1. Thus, the removal time is simply:t _(r)(n)=t _(r)(n−1)+t _(c)×pre_dec_removal_delay(n)   (D-10)

Yet, this recursion can be used to show that:

$\begin{matrix}{{t_{r}(n)} = {{t_{r}(0)} + {t_{c} \times {\sum\limits_{i = 1}^{n}\left\lbrack {{pre\_ dec}{\_ removal}{\_ delay}(m)} \right\rbrack}}}} & \text{(D-11)}\end{matrix}$

The calculation of arrival times is more complex, because of thecausality constraint. The initial arrival time of picture n is equal tothe final arrival time of picture n−1, unless that time precedes theearliest arrival time, computed by

$\begin{matrix}{{t_{{ai},{earliest}}(n)} = {t_{c} \times {\sum\limits_{l = 1}^{n}\left\lbrack {{pre\_ dec}{\_ removal}{\_ delay}(m)} \right\rbrack}}} & \text{(D-12)}\end{matrix}$

Where b(n) is the number of bits associated with picture n, the durationof the picture arrival interval is always the time-equivalent of thepicture size in bits, at the rate R:t _(af)(n)−t _(ai)(n)≡te[b(n)]=b(n)/R  (D-13)

FIG. 4 illustrates a segment of buffer fullness plot 400 for a CAT-LBwith the parameters given in table 500 of FIG. 5A and picture sizesgiven by column 551 of table 550 in FIG. 5B. Note that table 550 listsvalues for many times of interest in the buffering process. In table550, t_(e) is encoding time column 552, which represents a hypotheticalencoding time equal to the earliest possible initial arrival time of thepicture, t_(ai) is initial arrival time column 553, t_(af) is finalarrival time column 554, t_(ai)−t_(e) is initial arrival time lessencoding time column 555, t_(r) is removal time column 556, t_(r)−t_(ai)is removal time less initial arrival time column 557 and t_(r)−t_(e) isremoval time less encoding time column 558.

Referring to FIG. 4, it can be seen that the first picture is large, andis then followed by five (5) pictures at exactly the buffer arrival rateR, which is followed by twelve (12) pictures at half the rate, four (4)pictures at three times the rate and one (1) picture at twice the rate.Following the above pictures, FIG. 4 illustrates two segments withpictures at 30% and 50% of the rate, respectively. Further, the timeinterval of buffer fullness plot 400 from ten (10) seconds to eighteen(18) seconds illustrates HRD 100 behavior when the bit rate is constantand at or below the rate R. As shown, when the arrival bit rate remainsless than R for a time, the lower points of the fullness curve will notchange. Further, the fullness at the peak in such a segment will beproportional to the fraction of the peak rate being consumed by thepictures.

The time interval of buffer fullness plot 300 from eighteen (18) secondsto twenty-eight (28) seconds, shows a temporary effect of an increase inarrival rate to above R. Once the large pictures start exitingpre-decoder buffer 110, the bit rate of pictures leaving pre-decoderbuffer 110 exceeds R, and the fullness decreases. This processterminates at the thirty-two (32) second point, when the large pictureshave exited pre-decoder buffer 110 and the series of smaller picturesstarts entering pre-decoder buffer 110. During the time interval ofbuffer fullness plot 300 from thirty-six (36) seconds to forty-three(43) seconds, the 30% peak rate pictures are entering and leavingpre-decoder buffer 110. Further, and during the time interval of bufferfullness plot 300 from forty-three (43) seconds to fifty-two (52)seconds, 30% peak rate pictures are shown to be leaving while 50% pealrate pictures are entering pre-decoder buffer 110. As a result, thebuffer fullness rises. Once 50% peak rate pictures begin to leavepre-decoder buffer 110, the fullness stabilizes at 50% full. It shouldbe noted that VBV Buffer stabilizes at a fullness that is proportionalto the ratio of the short-term average bit rate to the arrival bit rate.

In general, the curve of buffer fullness plot 300 is given by thefollowing expression:

$\quad\begin{matrix}{{{BF}(t)}{\quad{= {\sum\limits_{n}^{\;}\left\lbrack {{{I\left( {{t_{af}(n)} \leq t < {t_{r}(n)}} \right)} \times {b(n)}} + {{I\left( {{t_{ai}(n)} < t < {t_{af}(n)}} \right)} \times {{be}\left( {t - {t_{ai}(n)}} \right)}}} \right\rbrack}}}} & \text{(D-14)}\end{matrix}$

The above expression uses indicator functions I(·) with time-relatedlogical assertions as arguments to sum those pictures that arecompletely in pre-decoder buffer 110 at time t, plus the appropriateportion of the picture currently entering pre-decoder buffer 110, ifany. The indicator function I(x) is “1” if x is true and “0” otherwise.

2. Low-Delay Operation

Low-delay behavior is obtained by selecting a low value for the initialpre-decoder removal delay. This results in true low delay through thebuffer, because under normal operation, no removal delay(t_(r)(n)−t_(ai)(n)) can exceed the initial removal delay t_(r)(0). Forexample, if the maximum removal delay for picture n occurs when theinitial arrival time is equal to the earliest arrival time, then themaximum removal delay is given by t_(r)(n)−t_(ai,earliest)(n). But,

$\begin{matrix}{{{t_{r}(n)} = {{t_{r}(0)} + {t_{c} \times {\sum\limits_{l = 1}^{n}\left\lbrack {{pre\_ dec}{\_ removal}{\_ delay}(m)} \right\rbrack}}}}{and}} & \text{(see~~D-11)} \\{{t_{{ai},{earliest}}(n)} = {t_{c} \times {\sum\limits_{l = 1}^{n}\left\lbrack {{pre\_ dec}{\_ removal}{\_ delay}(m)} \right\rbrack}}} & \text{(see~~D-12)}\end{matrix}$therefore,t _(r)(n)−t _(ai,earliest)(n)=t_(r)(0).  (D-15)

In other words, setting an initial low delay creates a steady-statelow-delay condition. However, in low-delay operation, it is useful to beable to process the occasional large picture whose size is so large thatit cannot be removed by its indicated removal time. Such a large picturecan arise at a scene change, for example. This would ordinarily lead toan “underflow” condition. When a large picture is encountered, the rulesfor removal are relaxed to prevent an underflow. The picture is removedat the delayed removal time, t_(r,ld)(n, m*), given byt _(r,ld)(n,m*)=t _(r)(0)+t _(c) ×m*,  (D-16)where m* is such that t_(r,ld)(n, m*−1)<t_(ai)(n)+te[B(n)]≦t_(r,ld)(n,m*). Note that pre-decoder buffer 110 must be large enough that suchlarge picture can be accommodated without overflow. Immediately aftersuch large picture is received the removal time of the next pictureshould be such that low-delay operation is resumed, which an encoder canfacilitate by skipping a number of pictures immediately after the largepicture, if necessary. Such low-delay operation may be achieved withoutexplicit signaling in the bitstream.

3. Bitstream Constraints

Pre-decoder buffer 110 should not be allowed to underflow or overflow.Furthermore, all pictures except the isolated big pictures should becompletely in pre-decoder buffer 110 before their computed removaltimes. Isolated big pictures are allowed to arrive later than theircomputed removal times, but should still obey the overflow constraint.In CBR mode, there must be no gaps in bit arrival.

a. Underflow

The underflow constraint, BF(t)≧0 for all t, is satisfied if the finalarrival time of each picture precedes its removal time.t _(af)(n)≦t _(r)(n)  (D-17)

The underflow constraint creates an upper bound on the size of picturen. The picture size may not be larger than the bit-equivalent of thetime interval from the start of arrival to the removal time.b(n)≦be[t _(r)(n)−t _(ai)(n)]  (D-18)

Since the initial arrival time t_(ai)(n) is in general a function of thesizes and removal delays of previous pictures, the constraint on b(n)will vary over time as well.

-   -   -   b. Overflow

Overflow can be avoided provided that the buffer fullness curve BF(t)never exceeds the buffer size B. The overflow constraints are that theinitial pre-decoder removal delay must not be larger than thetime-equivalent of the buffer size, t_(r)(0)≦te(B), and, under normaloperation, removal delay must not exceed the initial removal delay. Toavoid overflow of an isolated big picture, the picture size isconstrained by the following:b(n)≦be[B−t _(ai)(n)]  (D-19)

c. Constant Bit Rate (CBR) Operation

The CAT-LB model operates in constant bit rate mode if an additionalconstraint is applied to ensure that data constantly arrive at the inputof pre-decoder buffer 110. As a result, the average rate is equal to thebuffer rate R. Such additional constraint can be conformed with if thefinal arrival time of picture n is no earlier than the earliest initialarrival time of picture n+1. This time constraint places a lower boundon b(n).

$\begin{matrix}{{{t_{af}(n)} \geq {t_{{ai},{earliet}}\left( {n + 1} \right)}} = {t_{c} \times {\sum\limits_{l = 1}^{n}\left\lbrack {{pre\_ dec}{\_ removal}{\_ delay}(m)} \right\rbrack}}} & \text{(D-20)}\end{matrix}$

4. Rate Control Considerations

An encoder may employ rate control as a means to constrain the varyingbit rate characteristics of the bitstream in order to produce highquality coded pictures at the target bit rate(s). A rate controlalgorithm may target a VBR or CBR, or alternatively, a rate controlalgorithm may even target both a high peak rate using a VBR scheme andan average rate using a CBR scheme. Yet, multiple VBR rates may also betargeted.

This section discusses the VBV influence on rate control. In a VBR VBV,the buffer must not overflow or underflow, but gaps may appear in thearrival rate. In order to meet these constraints, the encoder mustensure that for all t, the following inequalities remain true:0≦BF(t)≦B, for all t.  (D-21)Using Equation D-14, D-21 becomes:

$\begin{matrix}{{0 \leq {\sum\limits_{n}^{\;}\left\lbrack {{{I\left( {{t_{af}(n)} \leq t < {t_{r}(n)}} \right)} \times {b(n)}} + {{I\left( {{t_{ai}(n)} < t < {t_{af}(n)}} \right)} \times {{be}\left( {t - {t_{ai}(n)}} \right)}}} \right\rbrack} \leq B},{{for}\mspace{14mu}{all}\mspace{14mu}{t.}}} & \text{(D-22)}\end{matrix}$

The buffer fullness B(t) is a piecewise non-decreasing function of time,with each non-decreasing interval bounded by two consecutive removaltimes. Therefore, it is sufficient to guarantee the conformance at theinterval endpoints; i.e. at the removal times. In particular, if anunderflow is prevented at the start of an interval (just after removalof a picture), it is completely prevented. The same holds for overflowat the end of the interval, just prior to picture removal. Therefore,the points of interest are the removal times. At t_(r) ⁻(n), picture nand possibly some additional pictures up to picture m>n (with the lastpicture possibly only partially in the buffer), are in the buffer andcontribute to Equation D-22. All pictures earlier than picture n havebeen removed. At t_(r) ⁺(n), picture n has been removed.

Accordingly, when encoding picture n, the rate control goal is toallocate bits to picture n and the others in the immediate future insuch a way that overflow is prevented at t_(r) ⁻(n), and underflow isprevented at t_(r) ⁺(n). Further, as long as b(n) is small enough sothat te[b(n)]≦t_(r)(n)−t_(ai)(n), both overflow at t_(r) ⁻(n) andunderflow at t_(r) ⁺(n) are prevented. This is usually a very highlimit, and a rate control method can further limit b(n) through itsallocation process.

III. Exemplary Syntax for the HRD

The following syntax shown in Table 1 is example syntax representingsome of sequence level information 318. In one embodiment, it iscontained within AVC syntax known as parameter set RBSP, betweentime_scale and num_slice_groups.

TABLE 1 time_scale 0 u(32) /* HRD Syntax in Parameter Set */nal_hrd_indicator 0 u(1) if (nal_hrd_indicator == 1)  hrd_parameters( )vcl_hrd_indicator 0 u(1) if (vcl_hrd_indicator == 1)  hrd_parameters( )num_slice_groups 0 u(3)

Table 2 below shows example syntax for the remaining sequence levelinformation 318 and for sequence level information 311.

TABLE 2 Hrd_parameters( ) {  /* CBR-VBV Parameters */  vbvi_cbr u(1)  if(vbvi_cbr) {   bit_rate_value_cbr u(18)   pre_dec_buffer_size_value_cbru(12)  }  /* VBR-VBV Parameters */  vbvi_vbr u(4)  for (k = 0; k<=vbvi_vbr; k++) {   bit_rate_value_vbr[k] u(18)  pre_dec_buffer_size_value_vbr[k] u(12)  } }

The following Table 3 shows example syntax for picture removal delayinformation 312 for use in conjunction with HRD 100, where the HRDsyntax is inserted before the rbsp_trailing_bits( ) syntax element.

TABLE 3 picture_layer_rbsp( ) { Category Descriptor  . . . pre_dec_removal_delay 3 e(v)  rbsp_trailing_bits( ) }

Further, the following illustrates example semantics for the abovesyntactical elements for HRD 100. If nal_hrd_indicator==“1”, themultiplexed NAL and VCL bitstream conforms with the HRD, as specifiedabove. In such event, the HRD parameters follow the nal_hrd_indicator inthe parameter set syntax. If nal_hrd_indicator==“0”, the multiplexed NALand VCL bitstream is not guaranteed to comply with the HRD. Ifvcl_hrd_indicator==“1”, the VCL bitstream conforms with the HRD, asspecified above. In such event, the HRD parameters follow thevcl_hrd_indicator in the parameter set syntax. Ifvcl_hrd_indicator==“0”, the VCL bitstream is not guaranteed to complywith the HRD.

If VBV indicator for Constant Bit Rate vbvi_cbr==“0”, the bitstream doesnot comply with a CBR-VBV Buffer, and vbvi_cbr==“1” means that thebitstream conforms with a CBR-VBV Buffer, and that CBR-VBV bufferingparameters follow in the syntax. VBV indicator for Variable Bit Rate orvbvi_vbr indicates the number of VBR VBV Buffers that the bitstreamconforms with, and vbvi_vbr==“0” is allowed. In one embodiment, when HRDconfiguration information indicates a low-delay operation, the sum ofvbvi_cbr and vbvi_vbr must be no more than one, i.e. only one VBV bufferis supported.

A positive integer coded using the universal VLC, pre_dec_removal_delayindicates how many clock ticks to wait after removal from the HRDpre-decoder buffer 110 of the coded data associated with the previouspicture before removing the coded data associated with this picture fromthe buffer. This value is also used to calculate an earliest possibletime of arrival of bits into the pre-decoder buffer, as defined above.

Table 4 below shows example buffering period message syntax for pictureremoval delay information 312 for use in conjunction with HRD 100.

TABLE 4 Buffering_period_message ( ) { Category Mnemonic parameter_set_id e(v)  (independent_GOP_para-  meter_set)  if(nal_hrd_indicator == 1) {   if (vbvi_cbr == 1)    pdrd_cbr u(16)   for(k = 0;k <= vbvi_vbr; k++)    pdrd_vbr[k] u(16)  }  if(vcl_hrd_indicator == 1) {   if (vbvi_cbr == 1)    pdrd_cbr u(16)   for(k = 0; k <= vbvi_vbr; k++)    pdrd_vbr[k] u(16)  } }

The following illustrates example buffering period message semantics forpicture removal delay information 312 for HRD 100. The parameter set IDindicates the parameter set that contains the sequence level HRDattributes. The fields pdrd_cbr and pdrd_vbr[k] represent thepre-decoder removal delay of a pre-decoder buffer in units of a 90 kHzclock. Each pdrd_xxx value represents the delay between the time ofarrival in the pre-decoder buffer of the first byte of the coded dataassociated with the picture (including all NAL data) and the time ofremoval of the coded data associated with the picture. The pdrd_xxxfields are used in conjunction with the VBV buffers as specified above.A value of zero is forbidden for pdrd_xxx.

IV. Summary of Exemplary Embodiments and Advantages of the HRD

As discussed above, in one aspect of the present invention, apre-decoder buffer removal time delay is transmitted for each picture,which is represented by the syntax elements pdrd_xxx in the bufferingperiod SEI message and pre_dec_removal_delay[n] in the picture layer. Inconventional hypothetical reference decoders, the removal time forremoving a picture from the pre-decoder buffer is either the earliestpossible time that the picture can be removed or is calculated based ona fixed frame rate—with a rule to handle one specific exception fromfixed frame rate in the case of the MPEG-2 standard. However, accordingto one embodiment of the present invention, each picture is removed fromthe pre-decoder buffer at a time calculated by adding the pre-decoderbuffer delay (which is transmitted for each picture) to the removal timeof the previous picture.

Accordingly, HRD of the present invention can handle variable frame ratevideo arising from any source. For example, in the case of handling thecarriage of film over video in MPEG-2, the HRD of MPEG-2 has specialremoval time rules based on the repeat_first_field flag in the pictureheader, which causes the removal delays to alternate between two fieldtimes and three field times. In the case of video conferencing, on theother hand, the frame rate may change as the coding difficulty of thescene changes. Both the above cases and others can be handled bytransmission of the explicit removal delay in the above-mentioned HRDembodiment of the present invention. In short, this embodiment of thepresent invention unifies multiple variable frame rate applications thatconventional HRDs have handled in non-unified ways.

Another aspect of the present invention is the delayed timing of thearrival of bits into the pre-decoder buffer based on the same removaltime delays, which results in a constrained leaky-buffer model. As afurther advantage of this aspect of the present invention the same HRDmodel can handle both low-delay and delay-tolerant scenarios. An HRD, inaccordance with this aspect of the present invention, can operate ineither low-delay or delay-tolerant modes without explicitly signalingits mode of operation, since a decoder can determine the real maximumdelay in seconds induced by the bitstream rate variations. Low-delayapplications can set a low initial removal delay by setting pdrd_xxx toan appropriate low value. Delay-tolerant applications may set theinitial delay to any value small enough that the buffer would notoverflow if it is receiving data at peak rate for that period of time.

Yet another aspect of the present invention includes two layers ofconformance. Unlike conventional HRDs, in one embodiment, HRD of thepresent invention can be signaled in the bitstream that the VCL conformsto an HRD, or that the NAL+VCL conforms to an HRD, or that both conformto an HRD. This aspect of the present invention is significant when abitstream may be repurposed or transcoded from one network environmentto another.

In a further embodiment, HRD of the present application appliesHRD-related constraints to a rate control algorithms as time-relatedinequalities, rather than picture-size related inequalities.

The following are a number of advantages that may be achieved using oneor more aspects of the present invention: enabling flexible variableframe-rate operation;; more closely matching HRD pre-decoder bufferarrival times with those produced by real-time encoders, whichsimplifies the real-time multiplexing problem; bitstreams areindependently verifiable and the HRD accommodates a leaky bucketapproach and is consistent with the multiple-leaky-bucket approach;arrival time delays described in the HRD do not have to be actualized ina streaming environment; provides for HRD parameters for VCL, NAL+VCL orboth; NAL+VCL HRD parameters can be added to an existing bitstream withVCL HRD; and the amount of delay in time through a low-delay HRD isexplicitly controlled.

Various embodiments of the invention are not discussed here but areapparent to a person of ordinary skill in the art. For example, thereare numerous ways to represent the pre-decoder removal delay both in thebuffering period message and in the picture message. It is alsoanticipated that the exact number of bits used to represent the syntaxelements or the formulas for converting the syntax elements to physicalquantities, such as bit rates and buffer sizes, could change withoutdeparting from the scope of the present invention. Moreover, the exactrule for computing the earliest possible arrival times could be modifiedto allow for a one-time shift in time. Moreover, while the invention hasbeen described with specific reference to certain embodiments, a personof ordinary skill in the art would recognize that changes could be madein form and detail without departing from the spirit and the scope ofthe invention. The described exemplary embodiments are to be consideredin all respects as illustrative and not restrictive. It should also beunderstood that the invention is not limited to the particular exemplaryembodiments described herein, but is capable of many rearrangements,modifications, and substitutions without departing from the scope of theinvention.

1. A method of analyzing a bitstream, said bitstream having a pluralityof compressed pictures and a plurality of messages, said methodcomprising the steps of: locating a buffering information messageincluding bit rate information and buffer size information; extractingsaid bit rate information and said buffer size information from saidbuffering information message; computing a bit rate and a buffer sizefrom said bit rate information and buffer size information; selecting arandom access point in said bitstream; locating a buffering periodmessage following said random access point; extracting random accessbuffering information from said buffering period message; computing fromsaid random access buffering information a picture removal timeassociated with the first picture following said buffering periodmessage; wherein for each compressed picture in the bitstream followingsaid first picture, said method further comprising: locating a picturemessage including picture removal time delay information; extractingsaid picture removal time delay information from said picture message;computing from said picture removal time delay information a pictureremoval time of said compressed picture; wherein for each compressedpicture following said buffering period message, said method furthercomprising: counting the number of bits representing said compressedpicture; computing an initial arrival time and a final arrival time ofsaid compressed picture, wherein said initial arrival time is equal toan earlier of said final arrival time of the immediately previouscompressed picture or equal to a sum of a fixed time plus a sum ofremoval delays of all of said compressed pictures between said firstcompressed picture following said buffering period message and saidcompressed picture, including said compressed picture, and wherein saidfinal arrival time is equal a sum of said initial arrival time and atime calculated based on the number of bits associated with saidcompressed picture at said bit rate; and verifying that a differencebetween said final removal time and said initial arrival time does notexceed the time for reaching said buffer size at said bit rate.
 2. Themethod of claim 1 further comprising the step of verifying for each ofsaid compressed pictures that said final arrival time precedes saidremoval time.
 3. The method of claim 1 further comprising the step ofverifying that said initial arrival time of each of said compressedpictures is equal to said final arrival time of the immediately previouscompressed picture.
 4. A method of processing a bitstream, saidbitstream having a plurality of compressed pictures and a plurality ofmessages, said method comprising: computing a bit rate and a buffer sizefrom bit rate information and buffer size information in said bitstream;computing, from a buffering period message, a picture removal timeassociated with the first picture following said buffering periodmessage; computing a picture removal time of said compressed picturefrom a picture message for each compressed picture in the bitstreamfollowing said first picture; wherein, for each compressed picturefollowing said buffering period message, said method further comprising:counting the number of bits representing said compressed picture;computing an initial arrival time and a final arrival time of saidcompressed picture, wherein said initial arrival time is equal to anearlier of said final arrival time of the immediately previouscompressed picture or equal to a sum of a fixed time plus a sum ofremoval delays of all of said compressed pictures between said firstcompressed picture following said buffering period message and saidcompressed picture, including said compressed picture, and wherein saidfinal arrival time is equal a sum of said initial arrival time and atime calculated based on the number of bits associated with saidcompressed picture at said bit rate; and verifying that a differencebetween said final removal time and said initial arrival time does notexceed the time for reaching said buffer size at said bit rate.
 5. Themethod of claim 4 further comprising verifying for each of saidcompressed pictures that said final arrival time precedes said removaltime.
 6. The method of claim 4 further comprising verifying that saidinitial arrival time of each of said compressed pictures is equal tosaid final arrival time of the immediately previous compressed picture.7. A system for processing a bitstream, said bitstream having aplurality of compressed pictures and a plurality of messages, saidsystem comprising: a decoder configured to receive said bitstream, saiddecoder having a pre-decoder buffer configured to buffer said bitstream;wherein said system performs: computing a bit rate and a buffer sizefrom bit rate information and buffer size information in said bitstream;computing, from a buffering period message, a picture removal timeassociated with the first picture following said buffering periodmessage; computing a picture removal time of said compressed picturefrom a picture message for each compressed picture in the bitstreamfollowing said first picture; wherein, for each compressed picturefollowing said buffering period message, said method further comprising:counting the number of bits representing said compressed picture;computing an initial arrival time and a final arrival time of saidcompressed picture, wherein said initial arrival time is equal to anearlier of said final arrival time of the immediately previouscompressed picture or equal to a sum of a fixed time plus a sum ofremoval delays of all of said compressed pictures, between said firstcompressed picture following said buffering period message and saidcompressed picture, including said compressed picture, and wherein saidfinal arrival time is equal a sum of said initial arrival time and atime calculated based on the number of bits associated with saidcompressed picture at said bit rate; and verifying that a differencebetween said final removal time and said initial arrival time does notexceed the time for reaching said buffer size at said bit rate.
 8. Thesystem of claim 7, wherein the system verifies that for each of saidcompressed pictures that said final arrival time precedes said removaltime.
 9. The system of claim 7, wherein the system verifies that saidinitial arrival time of each of said compressed pictures is equal tosaid final arrival time of the immediately previous compressed picture.